A Relation Between Network Computation and Functional Index Coding Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Index Codes via a Duality between Index Coding and Network Coding

In Index Coding, the goal is to use a broadcast channel as efficiently as possible to communicate information from a source to multiple receivers which can possess some of the information symbols at the source as side-information. In this work, we present a duality relationship between index coding (IC) and multiple-unicast network coding (NC). It is known that the IC problem can be represented...

متن کامل

the relation between bilingualism and translation: a case study of turkish bilingual and persian monolingual translation students

translation studies have become an accepted academic subject and books, journals and doctoral dissertations appear faster than one can read them all (bassnet and lefevere, 1990). but this field also brought with itself so many other issues which needed to be investigated more, in the heart of which, issues like ideology, ethics, culture, bilingualism and multilingualism. it is reported that ove...

Relation between Healthy Eating Index and Resting Metabolic Rate

Background and Objectives: Previouse studies demonstrated inverse association between healthy eating index and alot of chronic diseases like cardiovascular disease and cancer and mortality. Since there are limited study about relation between healthy eating index and reting metabolic rate. considering the results of some studies about the relation between weight, body composition and blood suge...

متن کامل

On a relation between uniform coding and problems of the form DTIMEF ( F ) = ? DSPACEF ( F ) Salvatore

If uniform coding (Gödelization) of potentially infinite sequences of numbers can be performed in PSPACEF, then PSPACE = EXPTIME 6= EXPSPACE = 2-EXPTIME, and, for all p, we have p−EXPSPACE = p+1-EXPTIME; if it can be performed in LINSPACEF, we also have LINSPACE = DTIME(2); the proof fails, when relativized to oracle-TM’s. A by-product of this research is that PTIMEF is not closed under number-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2017

ISSN: 0090-6778

DOI: 10.1109/tcomm.2016.2637922